On the Linear Intersection Number of Graphs
نویسندگان
چکیده
The celebrated Erdös, Faber and Lovász Conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an alternative formulation of the Erdös, Faber, Lovász conjecture. Finally, first results about the linear intersection number will be proved. For example, the definition of the linear intersection number immediately yields an easy upper bound, and we determine all graphs for which this bound is sharp. AMS Classification 05C15, 05C65, 51E14
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOn the Fractional Intersection Number of a Graph
An intersection representation of a graph G is a function f : V G ! 2 (where S is any set) with the property that uv A E G if and only if f uV f v0h. The size of the representation is jSj. The intersection number of G is the smallest size of an intersection representation of G. The intersection number can be expressed as an integer program, and the value of the linear relaxation of that p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003